منابع مشابه
Pairwise, t-Wise, and Pareto Optimalities
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive...
متن کاملt-Wise Balanced Designs
Steiner 3-wise balanced designs are constructed for parameters 3-(3n − 1, {4, 8}, 1), 3(qnm− qm, {q− 1, q, q+ 1}, 1), 3-(qnm− 2qm− 1, {qm− 3, qm− 2, qm− 1, qm, qm+ 1}, 1), 3-(qnm − 2qm, {qm − 3, qm − 2, qm − 1, qm, qm + 1}, 1), 3-(qnm − 2qm + 1, {qm − 3, qm − 2, qm−1, qm, qm+1}, 1), where q is a prime power and n ≥ 2, m ≥ 1 are integers. Further designs are obtained from these. © 2008 Elsevier ...
متن کامل“Two” Many Optimalities
In evolutionary biology a trait is said to be optimal if it maximizes the fitness of the organism, that is, if the trait allows the organism to survive and reproduce better than any other competing trait. In engineering, a design is said to be optimal if it complies with its functional requirements as best as possible. Cognitive science is both a biological and engineering discipline and hence ...
متن کاملt-Wise independence with local dependencies
In this note we prove a large deviation bound on the sum of random variables with the following dependency structure: there is a dependency graph G with a bounded chromatic number, in which each vertex represents a random variable. Variables that are represented by neighboring vertices may be arbitrarily dependent, but collections of variables that form an independent set in G are t-wise indepe...
متن کاملConstructing t-designs from t-wise balanced designs
We give a construction to obtain a t-design from a t-wise balanced design. More precisely, given a positive integer k and a t(v, {k1, k2, . . . , ks}, λ) design D, with with all block-sizes ki occurring in D and 1 ≤ t ≤ k ≤ k1 < k2 < · · · < ks, the construction produces a t-(v, k, nλ) design D∗, with n = lcm( ( k1−t k−t ) , . . . , ( ks−t k−t ) ). We prove that Aut(D) is a subgroup of Aut(D∗),...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Econometrica
سال: 1982
ISSN: 0012-9682
DOI: 10.2307/1912603